A multipole-expansion based linear sampling method for solving inverse scattering problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel Linear Sampling Method for Inverse Scattering Problems

A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asymptotically optimal computational complexity. For an n×n sampling mesh in R2 or an n×n×n sampling mesh in R3, the proposed algorithm requires one to solve only O(nN−1) far-field equations for a RN problem (N=2,3), and th...

متن کامل

Fast regularized linear sampling for inverse scattering problems

A new numerical procedure is proposed for the reconstruction of the shape and volume of unknown objects from measurements of their radiation in the far field. This procedure is a variant and the linear sampling method and has a very acceptable computational load and is fully automated. It is based on exploiting an iteratively computed truncated singular-value decomposition and heuristics to ext...

متن کامل

Multilevel Linear Sampling Method for Inverse Obstacle Scattering

In this talk, we will be mainly concerned with a novel multilevel linear sampling method (MLSM) for reconstructing the obstacle from its corresponding scattering amplitude. The new method is shown to possess asymptotically optimal computational complexity. For an n×n sampling mesh in R2 or an n×n×n sampling mesh in R3, the proposed algorithm requires to solve only O(nN−1) far-field equations fo...

متن کامل

Numerical Method for Solving 30 Inverse Scattering Problems

Let q(z) E L'(D), D C R3 is a bounded domain, q = 0 outside D, (I is real-valued. Assume that

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optics Express

سال: 2010

ISSN: 1094-4087

DOI: 10.1364/oe.18.006366